Dispute-Free Scalable Open Vote Network Using zk-SNARKs

The Open Vote Network is a self-tallying decentralized e-voting protocol suitable for boardroom elections. Currently, it has two Ethereum-based implementations: the first, by McCorry et al., scalability issue since all computations are performed on-chain. second implementation, Seifelnasr solves this partially assigning part of heavy to an off-chain untrusted administrator in verifiable manner. As side effect, implementation became not dispute-free; there need tally dispute phase where observer interrupts when cheats, i.e., announces wrong result. In work, we propose new smart contract design tackle problems previous implementations (i) preforming hence achieving higher scalability, and (ii) utilizing zero-knowledge Succinct Non-interactive Argument Knowledge (zk-SNARK) verify correctness computations, maintaining dispute-free property. To demonstrate effectiveness our design, develop prototype on Ethereum conduct multiple experiments different options that show trade-off between zk-SNARK proof generation time gas cost, including which consumes constant amount independent number voters.